GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS
نویسندگان
چکیده
منابع مشابه
Graph Products of Right Cancellative Monoids
Our first main result shows that a graph product of right cancellative monoids is itself right cancellative. If each of the component monoids satisfies the condition that the intersection of two principal left ideals is either principal or empty, then so does the graph product. Our second main result gives a presentation for the inverse hull of such a graph product. We then specialise to the ca...
متن کاملLeft I-quotients of band of right cancellative monoids
Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a semigroup of left I-quotients of $S$ if every element $qin Q$ can be written as $q=a^{-1}b$ for some $a,bin S$. If we insist on $a$ and $b$ being $er$-related in $Q$, then we say that $S$ is straight in $Q$. We characterize semigroups which are left I-quotients of left regular bands of right cancell...
متن کاملRight Cancellative and Left Ample Monoids: Quasivarieties and Proper Covers
The aim of this paper is to study certain quasivarieties of left ample monoids. Left ample monoids are monoids of partial one–one mappings of sets closed under the operation α 7→ αα−1. The idempotents of a left ample monoid form a semilattice and have a strong influence on the structure of the monoid; however, a left ample monoid need not be inverse. Every left ample monoid has a maximum right ...
متن کاملOn graph products of automatic monoids
The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids
متن کاملPrimary ideals of finitely generated commutative cancellative monoids
We give a characterization of primary ideals of finitely generated commutative monoids and in the case of finitely generated cancellative monoids we give an algorithmic method for deciding if an ideal is primary or not. Finally we give some properties of primary elements of a cancellative monoid and an algorithmic method for determining the primary elements of a finitely generated cancellative ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 2009
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s144678870900010x